Введите слово или словосочетание на любом языке 👆
Язык:
Перевод и анализ слов искусственным интеллектом ChatGPT
На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:
- как употребляется слово
- частота употребления
- используется оно чаще в устной или письменной речи
- варианты перевода слова
- примеры употребления (несколько фраз с переводом)
- этимология
Что (кто) такое higher-order functions - определение
FUNCTION THAT TAKES ONE OR MORE FUNCTIONS AS AN INPUT OR THAT OUTPUTS A FUNCTION
Higher-order functions; Higher order functions; Higher order function; First order functions; Functional form; Second-order function; First-order function; First order function; Comparison of programming languages (higher-order functions); Function function
Найдено результатов: 4326
higher-order function
(HOF) A function that can take one or more functions as
argument and/or return a function as its value. E.g. map in
(map f l) which returns the list of results of applying
function f to each of the elements of list l. See also
curried function.
Higher-order thinking
![Categories in the cognitive domain of [[Bloom's taxonomy]] (Anderson & Krathwohl, 2001)](https://commons.wikimedia.org/wiki/Special:FilePath/BloomsCognitiveDomain.svg?width=200 "Categories in the cognitive domain of [[Bloom's taxonomy]] (Anderson & Krathwohl, 2001)")
EDUCATION CONCEPT ARGUING THAT SOME TYPES OF LEARNING REQUIRE MORE COGNITIVE PROCESSING BUT ALSO HAVE MORE GENERALIZED BENEFITS
Higher order thinking skills; Higher order thinking; High Order Thinking Skills
Higher-order thinking, known as higher order thinking skills (HOTS), is a concept of education reform based on learning taxonomies (such as Bloom's taxonomy). The idea is that some types of learning require more cognitive processing than others, but also have more generalized benefits.
Higher-order logic
FORM OF PREDICATE LOGIC THAT IS DISTINGUISHED FROM FIRST-ORDER LOGIC BY ADDITIONAL QUANTIFIERS AND, SOMETIMES, STRONGER SEMANTICS
Higher-order predicate; Higher order logic; Higher order logics; Ordered logic; Higher-order logics; High order logic; High-order logic; Order (logic); Semantics of higher-order logic
In mathematics and logic, a higher-order logic is a form of predicate logic that is distinguished from first-order logic by additional quantifiers and, sometimes, stronger semantics. Higher-order logics with their standard semantics are more expressive, but their model-theoretic properties are less well-behaved than those of first-order logic.
Fold (higher-order function)
FAMILY OF HIGHER-ORDER FUNCTIONS THAT ANALYZE A RECURSIVE DATA STRUCTURE AND BUILD UP A RETURN VALUE
Foldl; Foldr; Right fold; Left fold; Reduce (higher-order function); Fold function; Fold (higher order function); Accumulate (higher-order function); Fold (function); Reduce function; FoldLeft; FoldRight
In functional programming, fold (also termed reduce, accumulate, aggregate, compress, or inject) refers to a family of higher-order functions that analyze a recursive data structure and through use of a given combining operation, recombine the results of recursively processing its constituent parts, building up a return value. Typically, a fold is presented with a combining function, a top node of a data structure, and possibly some default values to be used under certain conditions.
Higher-order volition
PHILOSOPHICAL TERM
Second-order desire; Second order desire; Higher order desire; Higher order desires; First order desires; Higher-order desire; Higher-order volitions; First-order volition; First order desire; First-order desire
Higher-order volitions (or higher-order desire), as opposed to action-determining volitions, are volitions about volitions. Higher-order volitions are potentially more often guided by long-term convictions and reasoning.
Higher-order abstract syntax
TECHNIQUE FOR THE REPRESENTATION OF ABSTRACT SYNTAX TREES IN LANGUAGES WITH VARIABLE BINDERS
Higher order abstract syntax
In computer science, higher-order abstract syntax (abbreviated HOAS) is a technique for the representation of abstract syntax trees for languages with variable binders.
Higher-order differential cryptanalysis
TYPE OF CRYPTANALYTIC ATTACK
Higher order differential cryptanalysis
In cryptography, higher-order differential cryptanalysis is a generalization of differential cryptanalysis, an attack used against block ciphers. While in standard differential cryptanalysis the difference between only two texts is used, higher-order differential cryptanalysis studies the propagation of a set of differences between a larger set of texts.
Higher order message
Higher Order Messages
A higher order message (HOM) in a computer programming language is a form of higher-order programming that allows messages that have other messages as arguments. The concept was introduced at MacHack 2003MacHack HOM PresentationO'Reilly macdevcenter article by Marcel Weiher and presented in a more complete form in 2005 by Marcel Weiher and Stéphane Ducasse.
Higher-order programming
Higher order programming
Higher-order programming is a style of computer programming that uses software components, like functions, modules or objects, as values. It is usually instantiated with, or borrowed from, models of computation such as lambda calculus which make heavy use of higher-order functions.
Higher-order statistics
Higher-Order Statistics; High-order statistics
In statistics, the term higher-order statistics (HOS) refers to functions which use the third or higher power of a sample, as opposed to more conventional techniques of lower-order statistics, which use constant, linear, and quadratic terms (zeroth, first, and second powers). The third and higher moments, as used in the skewness and kurtosis, are examples of HOS, whereas the first and second moments, as used in the arithmetic mean (first), and variance (second) are examples of low-order statistics.
Википедия
Higher-order function
In mathematics and computer science, a higher-order function (HOF) is a function that does at least one of the following:
- takes one or more functions as arguments (i.e. a procedural parameter, which is a parameter of a procedure that is itself a procedure),
- returns a function as its result.
All other functions are first-order functions. In mathematics higher-order functions are also termed operators or functionals. The differential operator in calculus is a common example, since it maps a function to its derivative, also a function. Higher-order functions should not be confused with other uses of the word "functor" throughout mathematics, see Functor (disambiguation).
In the untyped lambda calculus, all functions are higher-order; in a typed lambda calculus, from which most functional programming languages are derived, higher-order functions that take one function as argument are values with types of the form .
